Ligand Ordering Parameters
نویسندگان
چکیده
منابع مشابه
Structural identifiability of equilibrium ligand-binding parameters
Understanding the interactions of proteins with their ligands requires knowledge of molecular properties, such as binding site affinities and the effects that binding at one site exerts on binding at other sites (cooperativity). These properties cannot be measured directly and are usually estimated by fitting binding data with models that contain these quantities as parameters. In this study, w...
متن کاملCrystal nucleation as the ordering of multiple order parameters.
Nucleation is an activated process in which the system has to overcome a free energy barrier in order for a first-order phase transition between the metastable and the stable phases to take place. In the liquid-to-solid transition, the process occurs between phases of different symmetry, and it is thus inherently a multi-dimensional process, in which all symmetries are broken at the transition....
متن کاملRecent Results on Ordering Parameters in Boolean Networks
The dynamics of discrete mathematical systems can be related to the values of certain ordering parameters. Experiments with the total set of possible structures of a boolean network with six elements and extended sets of two-valued boolean functions show that three simple parameters describing the topology, the bias of boolean functions, and their canalyzing potential yield necessary conditions...
متن کاملLigand-induced Ordering of the C-terminal Tail Primes STING for Phosphorylation by TBK1
The innate immune protein Stimulator of interferon genes (STING) promotes the induction of interferon beta (IFN-β) production via the phosphorylation of its C-terminal tail (CTT) by TANK-binding kinase 1 (TBK1). Potent ligands of STING are, therefore, promising candidates for novel anti-cancer drugs or vaccine adjuvants. However, the intrinsically flexible CTT poses serious problems in in silic...
متن کاملCo-ordering and Type 2 co-ordering
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational numbers. One of the main questions there, was:"For a specific c.e. set A, consider set of all enumerations of it which is generated by some Turing machine {...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Australian Journal of Physics
سال: 1977
ISSN: 0004-9506
DOI: 10.1071/ph770315